Multi-Agent Combinatorial Optimization under Submodular Functions
نویسندگان
چکیده
Submodular functions are the discrete ananlogue of convexity and generalize many known and well studied settings. They capture several economic principles such as decreasing marginal cost and correlated utilities. Multi-agent allocation problems over submodular functions arise in a variety of natural scenarios and have been the subject of extensive study over the last decade. In this proposal I will introduce the Online Submodular Welfare Maximization Problem and possible approaches towards solving it. I will also present a short literature survey and some of my prior work in this field.
منابع مشابه
Combinatorial Problems with Discounted Price Functions in Multi-agent Systems
Motivated by economic thought, a recent research agenda has suggested the algorithmic study of combinatorial optimization problems under functions which satisfy the property of decreasing marginal cost. A natural first step to model such functions is to consider submodular functions. However, many fundamental problems have turned out to be extremely hard to approximate under general submodular ...
متن کاملOptimal Approximation Algorithms for Multi-agent Combinatorial Problems with Discounted Price Functions
Submodular functions are an important class of functions in combinatorial optimization which satisfy the natural properties of decreasing marginal costs. The study of these functions has led to strong structural properties with applications in many areas. Recently, there has been significant interest in extending the theory of algorithms for optimizing combinatorial problems (such as network de...
متن کاملSome Results about the Contractions and the Pendant Pairs of a Submodular System
Submodularity is an important property of set functions with deep theoretical results and various applications. Submodular systems appear in many applicable area, for example machine learning, economics, computer vision, social science, game theory and combinatorial optimization. Nowadays submodular functions optimization has been attracted by many researchers. Pendant pairs of a symmetric...
متن کاملMaximizing Submodular Functions under Matroid Constraints by Multi-objective Evolutionary Algorithms
Many combinatorial optimization problems have underlying goal functions that are submodular. The classical goal is to find a good solution for a given submodular function f under a given set of constraints. In this paper, we investigate the runtime of a multi-objective evolutionary algorithm called GSEMO until it has obtained a good approximation for submodular functions. For the case of monoto...
متن کاملSubmodular Functions: from Discrete to Continous Domains
Submodular set-functions have many applications in combinatorial optimization, as they can be minimized and approximately maximized in polynomial time. A key element in many of the algorithms and analyses is the possibility of extending the submodular set-function to a convex function, which opens up tools from convex optimization. Submodularity goes beyond set-functions and has naturally been ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2011